A Primal Barvinok Algorithm Based on Irrational Decompositions
نویسنده
چکیده
We introduce variants of Barvinok’s algorithm for counting lattice points in polyhedra. The new algorithms are based on irrational signed decomposition in the primal space and the construction of rational generating functions for cones with low index. We give computational results that show that the new algorithms are faster than the existing algorithms by a large factor.
منابع مشابه
Computing Parametric Rational Generating Functions with a Primal Barvinok Algorithm
Computations with Barvinok’s short rational generating functions are traditionally being performed in the dual space, to avoid the combinatorial complexity of inclusion–exclusion formulas for the intersecting proper faces of cones. We prove that, on the level of indicator functions of polyhedra, there is no need for using inclusion–exclusion formulas to account for boundary effects: All linear ...
متن کاملOn Alternative Decompositions and Distributed Algorithms for Network Utility Problems
Network utility maximization problems arise when the design of a data network is formulated as a whole by means of utility functions. Although fully centralized algorithms are theoretically possible, in practical networks it is desirable to obtain distributed algorithms of simple implementation. In the existing literature, this is typically achieved by means of the so-called dual decomposition ...
متن کاملSolving fully fuzzy Linear Programming Problem using Breaking Points
Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 21 شماره
صفحات -
تاریخ انتشار 2007